Ask
Login
TAGGED IN

Analysis Of Algorithms

Follow this tag to get notifications whenever a new post is added

ALL TAGS
3
votes
1
answer
17k
views
1
answer
Let n=4 Profit={1, 2, 5, 6} Weight= {2, 3, 4, 5} M=8 Find solution to 0/1 Knapsack Problem using Dynamic Programming.
analysis of algorithms updated 2.5 years ago by pg1118329 • 0
0
votes
0
answers
2.4k
views
0
answers
(Duplicate) Write down algorithm of job sequencing using deadlines. Solve the following Problem.
analysis of algorithms updated 4.2 years ago by pg1118329 • 0
1
vote
1
answer
3.3k
views
1
answer
Write down Prims algorithm and solve the following problem
analysis of algorithms updated 4.2 years ago by pg1118329 • 0
2
votes
1
answer
23k
views
1
answer
Define Knapsack problem. Solve the following 0/1 Knapsack problem using dynamic programming Let n=3 , p={1,2,5), w=(2,3,4) and m=6
analysis of algorithms updated 4.3 years ago by pg1118329 • 0
0
votes
0
answers
2.2k
views
0
answers
(Duplicate) Explain with suitable example job sequencing with deadlines
analysis of algorithms updated 4.3 years ago by krithikkm200 • 10
2
votes
1
answer
2.8k
views
1
answer
Find longest sub sequence of given two strings BATA and TATA
analysis of algorithms updated 4.3 years ago by pg1118329 • 0
0
votes
0
answers
2.2k
views
0
answers
(Duplicate) Find Longest Common Subsequence(LCS) for given strings X= ABACABB Y=BABCAB
analysis of algorithms updated 4.3 years ago by nandanaaach364 • 20
1
vote
0
answers
2.0k
views
0
answers
(Duplicate) Find maximum profit using Fractional Knapsack approach(Greedy Method) n=6, m=13, P={18, 5, 9, 10, 12, 7}, W={7, 2, 3, 5, 3, 2}
analysis of algorithms updated 4.3 years ago by nandanaaach364 • 20
0
votes
0
answers
1.8k
views
0
answers
(Duplicate) What is Longest Common Subsequence Problem? Find out the longest Common subsequence for the given data String-1:- TATA String-2:- BATA
analysis of algorithms updated 4.3 years ago by nandanaaach364 • 20
3
votes
1
answer
9.1k
views
1
answer
Sort the following numbers using Quick sort algorithm. Show all passes of execution also state the following state the time complexity.
analysis of algorithms updated 4.3 years ago by pg1118329 • 0
0
votes
0
answers
1.4k
views
0
answers
(Duplicate) Explain Flow Shop Scheduling with the help of suitable examples.
analysis of algorithms updated 4.3 years ago by phenjoisilab • 0
10
votes
1
answer
24k
views
1
answer
Write an algorithm to solve the N-Queens problem. Show working for N=4.
analysis of algorithms updated 4.3 years ago by yashbeer ★ 11k
6
votes
1
answer
5.6k
views
1
answer
Find the longest common subsequence for the following two strings: X=ABACABB Y=BABCAB
analysis of algorithms updated 4.3 years ago by pg1118329 • 0
2
votes
1
answer
4.9k
views
1
answer
Write a program for knapsack problem
analysis of algorithms updated 4.3 years ago by teamques10 ★ 70k
0
votes
1
answer
3.8k
views
1
answer
Solve the following single source shortest path problem assuming vertex 5 as the source.
analysis of algorithms updated 4.3 years ago by krithikkm200 • 10
3
votes
1
answer
6.1k
views
1
answer
Define space and Time complexity with suitable example.
analysis of algorithms updated 4.3 years ago by pg1118329 • 0
1
vote
1
answer
17k
views
1
answer
Write Quicksort Algorithm using last element as pivot element. Apply this algorithm to sort the following list of array element. Show action step by step. 23, 12, -7, 16, 18, 35, 35, 28, 5
analysis of algorithms updated 4.3 years ago by pg1118329 • 0
6
votes
1
answer
9.1k
views
1
answer
Apply Dijkstras algorithm on the following graph
analysis of algorithms updated 4.4 years ago by pg1118329 • 0
2
votes
1
answer
13k
views
1
answer
Solve fractional knapsack problem for the following
analysis of algorithms updated 4.4 years ago by pg1118329 • 0
3
votes
1
answer
52k
views
1
answer
Apply Quick Sort Algorithm to sort the list E, X, A, M, P, L, E
analysis of algorithms updated 4.4 years ago by pg1118329 • 0
0
votes
1
answer
3.3k
views
1
answer
Greedy Approach v/s Dynamic Programming
analysis of algorithms updated 4.4 years ago by pg1118329 • 0
3
votes
1
answer
5.9k
views
1
answer
Explain Maximum subarray problem. How it is resolved by divide and conquer algorithm. Also analyze your algorithm.
analysis of algorithms updated 4.4 years ago by pg1118329 • 0
3
votes
1
answer
11k
views
1
answer
Explain the general procedure of divide and conquer method.
analysis of algorithms updated 4.4 years ago by pg1118329 • 0
3
votes
1
answer
2.7k
views
1
answer
Give an algorithm for Strassen's Multiplication. Explain how a divide and conquer strategy is applicable to it? Also analyze your algorithm.
analysis of algorithms updated 4.4 years ago by yerasylmakulbe671 • 10
0
votes
1
answer
2.6k
views
1
answer
The Strassen's Matrix
analysis of algorithms updated 4.5 years ago by krithikkm200 • 10
<prev • 153 results • page 1 of 7 • next >